منابع مشابه
Predicate Abstraction
Designing basic protocols, used in networking, security and multiprocessor systems is hard. All of these have to deal with concurrency, that is the actions of multiple agents in parallel. This makes their design error-prone since all possible interactions between the various agents in the system have to be considered. In addition to concurrency, many of these protocols are designed to work with...
متن کاملExperimenting with Predicate Abstraction
Predicate abstraction is a technique employed in software model checking to produce abstract models that can be conservatively checked for property violations in reasonable time. The precision degree of different abstractions of the same program may differ based on (i) the set of predicates used; or (ii) the algorithmic technique employed to generate the model. In this paper we explain how we h...
متن کاملExperience with Predicate Abstraction
This reports some experiences with a recently-implemented prototype system for veriication using predicate abstraction, based on the method of Graf and Sa di 9]. Systems are described using a language of iterated guarded commands, called Mur ?? (since it is a simpliied version of our Mur protocol description language). The system makes use of two libraries: SVC 1] (an eecient decision procedure...
متن کاملRanking Abstraction as Companion to Predicate Abstraction
Predicate abstraction has become one of the most successful methodologies for proving safety properties of programs. Recently, several abstraction methodologies have been proposed for proving liveness properties. This paper studies “ranking abstraction” where a program is augmented by a non-constraining progress monitor, and further abstracted by predicate-abstraction, to allow for automatic ve...
متن کاملPredicate Abstraction with Minimum Predicates
Predicate abstraction is a popular abstraction technique employed in formal software verification. A crucial requirement to make predicate abstraction effective is to use as few predicates as possible, since the abstraction process is in the worst case exponential (in both time and memory requirements) in the number of predicates involved. If a property can be proven to hold or not hold based o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Programming Languages and Systems
سال: 2005
ISSN: 0164-0925,1558-4593
DOI: 10.1145/1057387.1057391